Solution of Linear Systems Arising in
نویسنده
چکیده
This paper deals with the solution of large linear systems which arise when certain optimization methods are applied in image de-blurring. An unconstrained penalized least squares minimization problem with total variation penalty is considered. Also addressed are several penalized least squares problems with nonnegativity constraints imposed on the solution. In each case, quasi-Newton techniques yield large struc-tured linear systems. We investigate various preconditioning strategies to eeciently solve these linear systems.
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملP-stability, TF and VSDPL technique in Obrechkoff methods for the numerical solution of the Schrodinger equation
Many simulation algorithms (chemical reaction systems, differential systems arising from the modeling of transient behavior in the process industries and etc.) contain the numerical solution of systems of differential equations. For the efficient solution of the above mentioned problems, linear multistep methods or Runge-Kutta technique are used. For the simulation of chemical procedures the ra...
متن کاملSymplectic and symmetric methods for the numerical solution of some mathematical models of celestial objects
In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...
متن کاملMinimal solution of fuzzy linear systems
In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.
متن کامل